Information Combining Ingmar Land
نویسنده
چکیده
Consider coded transmission over a binary-input symmetric memoryless channel. The channel decoder uses the noisy observations of the code symbols to reproduce the transmitted code symbols. Thus, it combines the information about individual code symbols to obtain an overall information about each code symbol, which may be the reproduced code symbol or its a-posteriori probability. This tutorial addresses the problem of “information combining” from an information-theory point of view: the decoder combines the mutual information between channel input symbols and channel output symbols (observations) to the mutual information between one transmitted symbol and all channel output symbols. The actual value of the combined information depends on the statistical structure of the channels. However, it can be upper and lower bounded for the assumed class of channels. This book first introduces the concept of mutual information profiles and revisits the well-known Jensen’s inequality. Using these tools, the bounds on information combining are derived for single parity-check codes and for repetition codes. The application of the bounds is illustrated in four examples: information processing characteristics of coding schemes, including extrinsic information transfer (EXIT) functions; design of multiple turbo codes; bounds for the decoding threshold of low-density parity-check codes; EXIT function of the accumulator.
منابع مشابه
Bounds on mutual information for simple codes using information combining
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the overall mutual information between encoder input and decoder output. The overall mutual information is interpreted as a combination of the mutual informations associated with the individual code symbols. Thus, exploiting...
متن کاملMutual Information Profile of a BISMC with Applications
It is shown how to decompose any Binary Input Symmetric Memoryless Channel (BISMC) into BSCs. We explain why BEC and BSC are the two extreme cases of any BISMC with respect to the Mutual Information Profile (MIP). Finally, the paper points out useful applications for MIP.
متن کاملComparison of Convolutional Coupled Codes and Partially Systematic Turbo Codes for Medium Code Lengths
Ingmar Land Information and Coding Theory Lab University of Kiel, Germany e-mail: [email protected] http://www.tf.uni-kiel.de/ict Slim Chaoui Institute for Communications Technology Darmstadt University of Technology, Germany e-mail: [email protected] http://www.nesi.e-technik.tu-darmstadt.de Abstract | Two classes of concatenated codes of rate 1/2 and medium code lengths (600, 2000) ar...
متن کاملLand Suitability Classification for Persian Walnut Cultivation in Iran Using Geographic Information System (GIS)
The efficient use of water resources, soil, and climate parameters as the main pillars of plant sustainable production requires land suitability evaluation for each crop and area. This research was conducted to evaluate land suitability for walnut cultivation in Iran using geographic information system (GIS). For this purpose, the climate data obtained from 375 synoptic stations of Iran, the ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006